منابع مشابه
An Algorithm to Compute
The following problem is addressed: given square matrices A and B, compute the smallest such that A + E and B + F have a common eigenvalue for some E, F with max(‖E‖2, ‖F‖2) ≤ . An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.
متن کاملAn Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)
Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...
متن کاملAn Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting from their initial knowledge, and have presented a complete solution for a special case of the problem. In this paper we present an algorithm that solves the general case. Given a collusion problem the algorithm deter...
متن کاملAn algorithm to compute plane algebraic curves
This paper contains an algorithm, implemented in Magma, to compute singular plane algebraic curves. Two Magma functions are given: one computes linear systems of curves with non-ordinary singularities and the other computes a scheme of points such that there is a given degree plane curve with given singularities at these points. Some examples are presented so that the reader can quickly learn h...
متن کاملAn algorithm to compute relative cubic fields
Let K be an imaginary quadratic number field with class number 1. We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/K up to a bound X on the norm of the relative discriminant ideal. The main tools are Taniguchi’s [18] generalization of Davenport-Heilbronn parametrisation of cubic extensions, and reduction theory for binary cubic forms ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: manuscripta mathematica
سال: 2021
ISSN: 0025-2611,1432-1785
DOI: 10.1007/s00229-021-01285-8